Oblivious OSPF Routing with Weight Optimization under Polyhedral Demand Uncertainty1
نویسندگان
چکیده
The desire for configuring well-managed OSPF routes to handle today’s communication needs with larger networks and changing service requirements has opened the way to use traffic engineering tools with OSPF protocol. Moreover, anticipating possible shifts in expected traffic demands while using network resources efficiently has started to gain more attention. We consider these two crucial issues and study a weight-managed OSPF routing problem for polyhedral demands. Our motivation is to optimize the link weight metric such that the minimum cost routing uses shortest paths with Equal Cost Multi-Path (ECMP) splitting, and the routing decisions are robust to possible fluctuations in demands. We provide an algorithmic approach with two variations to tackle the problem. We present several test results and discuss whether we could make our weight-managed OSPF comparable to unconstrained routing.
منابع مشابه
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
The desire for configuring well-managed OSPF routes to handle the communication needs in the contemporary business world with larger networks and changing service requirements has opened the way to use traffic engineering tools with the OSPF protocol. Moreover, anticipating possible shifts in expected traffic demands while using network resources efficiently has started to gain more attention. ...
متن کاملOSPF Routing with Optimal Oblivious Performance Ratio Under Polyhedral Demand Uncertainty
We study the best OSPF style routing problem in telecommunication networks, where weight management is employed to get a routing configuration with the minimum oblivious ratio. We consider polyhedral demand uncertainty: the set of traffic matrices is a polyhedron defined by a set of linear constraints, and the performance of each routing is assessed on its worst case congestion ratio for any fe...
متن کاملOptimizing Load Balancing Routing Mechanisms with Evolutionary Computation
Link State routing protocols, such as Open Shortest Path First (OSPF), are widely applied to intra-domain routing in todays IP networks. They provide a good scalability without lost of simplicity. A router running OSPF distributes traffic uniformly over Equal-cost Multi-path (ECMP), enabling a better distribution of packets among the existent links. More recently, other load balancing strategie...
متن کاملOptimal oblivious routing under statistical uncertainty
In telecommunication networks, a common measure is the maximum congestion (i.e., utilisation) on edge capacity. As traffic demands are often known with a degree of uncertainty, network management techniques must take into account traffic variability. The oblivious performance of a routing is a measure of how congested the network may get, in the worst case, for one of a set of possible traffic ...
متن کاملOSPF Weight Tuning for Efficient Routing in IP Networks
Routing within a telecommunication network defines how the traffic flow is mapped on the network topology. The increasing commercial importance of the Internet together with a rising number of real-time applications make of the routing mechanisms as essential feature in the control of the network performance. The routing mechanisms involved allow to assign the network capacities, more or less e...
متن کامل